The Evolution of Dominance Constraint Solvers
نویسندگان
چکیده
We describe the evolution of solvers for dominance constraints, a formalism used in underspecified semantics, and present a new graph-based solver using charts. An evaluation on real-world data shows that each solver (including the new one) is significantly faster than its predecessors. We believe that our strategy of successively tailoring a powerful formalism to the actual inputs is more generally applicable.
منابع مشابه
Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, branch-and-bound algorithm. In this paper, we propose path-symmetry and path-dominance, which are instances of the symmetry detection by dominance detection approach for pruning symmetric nodes in the MKP branch-and-bound search...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملProfit maximization solid transportation problem under budget constraint using fuzzy measures
Fixed charge solid transportation problems are formulated as profit maximization problems under a budget constraint at each destination. Here item is purchased in different depots at different prices. Accordingly the item is transported to different destinations from different depots using different vehicles. Unitsare sold from different destinations to the customers at different selling prices...
متن کاملImproving Combinatorial Optimization - Extended Abstract
Combinatorial Optimization is an important area of computer science that has many theoretical and practical applications. In the thesis [Chu, 2011], we present important contributions to several different areas of combinatorial optimization, including nogood learning, symmetry breaking, dominance, relaxations and parallelization. We develop a new nogood learning technique based on constraint pr...
متن کاملOptimization of the Prismatic Core Sandwich Panel under Buckling Load and Yield Stress Constraints using an Improved Constrained Differential Evolution Algorithm
In this study, weight optimization of the prismatic core sandwich panel under transverse and longitudinal loadings has been independently investigated. To solve the optimization problems corresponding to the mentioned loadings, a new Improved Constrained Differential Evolution (ICDE) algorithm based on the multi-objective constraint handling method is implemented. The constraints of the problem...
متن کامل